Peer-to-peer communication system and peer-to-peer processing apparatus

ABSTRACT

Embodiments of the disclosure relate to a communication system, in particular, peer-to-peer communication system. The communication system includes at least one peer-to-peer network having at least one peer-to-peer application and at least one peer-to-peer processing apparatus having at least one processor module configured to process at least a part of a first task during a first time slice and at least a part of at least one further task during at least one further time slice. The communication system also includes at least one peer-to-peer module assigned to the peer-to-peer processing apparatus and configured to communicate with the peer-to-peer application. At least one of the first task and the further task is a distributed peer-to-peer application provided to the peer-to-peer processing apparatus by means of the peer-to-peer application.

CROSS-REFERENCE TO RELATED PATENT APPLICATION

This patent application is a continuation of PCT/EP2016/069056, filedAug. 10, 2016, the entire teachings and disclosure of which areincorporated herein by reference thereto.

FIELD

The invention relates to a communication system, in particular,peer-to-peer communication system. Further, the invention relates to amethod for operating a communication system, a peer-to-peer processingapparatus and a peer-to-peer application.

BACKGROUND

A communication network, such as the internet or an intranet, maycomprise several processing apparatuses, such as computers, whichcomprise one or more processor modules configured to conduct/processtask(s). Some of the processing apparatuses have a high processing powerin order to process a task requiring a high processing power within ashort time period. The task may be a specific (software) application.However, some processing apparatuses merely comprise a small processingpower. These processing apparatuses are only capable of conducting taskswithin significant longer timer periods.

It has been found that some of the powerful processing apparatuses arenot fully used. The reason may be that the high processing power is onlytemporarily needed resulting in unused time periods. Another reason maybe that the processing apparatus has been set up for conducting aspecific task. This task may be already fulfilled or the processing ofthe task may not be worthwhile any more. Hence, current communicationsystems comprise imbalances between powerful and not fully usedprocessing apparatuses and processing apparatuses (e.g. with smallprocessing power) which are fully used.

Indeed, it may be possible to implement a new task in form of a newapplication onto a processing apparatus, such as a server, which is notfully used. For instance, a client may request the conduction of aspecific task through the server (e.g. one or more computers). However,due to the structure of prior art communication systems in form ofserver-client structures there exist no possibility to use the generallyavailable resources in an efficient and secure manner. In particular,the managing and controlling of the provision, installation andoperation of a task in form of an application is complex and requiresusually manual interactions.

A further disadvantage of server-client structures of this kind,particularly the server (or platform), apart from the high transactioncosts, is that the central instance or central server managesconfidential data, such as user data including e.g. access data for anapplication, application data, processing results or the like. Apersistent problem affecting the central instance is that of protectingthe confidential data stored on one or more server(s) from access byunauthorized third parties. In particular, a high degree of securityexpenditure is required, in order to prevent said data from beingtampered with. This in turn leads to higher transaction costs. A furtherdisadvantage is the complex and costly infrastructure for providing thedescribed server-client structure. Furthermore, it is not possible touse available resources (free processing time of one or more processingapparatuses) by other entities in a simple manner.

Therefore, it is an object of the present invention to provide acommunication system which enables to use available (processing)resources more efficient and, at the same time, with high security.

BRIEF SUMMARY

The object is solved according to a first aspect of the presentinvention by a communication system, in particular, peer-to-peercommunication system, as disclosed herein. The communication systemcomprises at least one peer-to-peer network comprising at least onepeer-to-peer application. The communication system comprises at leastone peer-to-peer processing apparatus comprising at least one processormodule configured to process at least a part of a first task during afirst time slice and at least a part of at least one further task duringat least one further time slice. The communication system comprises atleast one peer-to-peer module assigned to the peer-to-peer processingapparatus and configured to communicate with the peer-to-peerapplication, wherein at least one of the first task and the further taskis a distributed peer-to-peer application provided to the peer-to-peerprocessing apparatus via by means of the peer-to-peer application.

In contrast to prior art communication systems, the available(processing) resources of a communication system or network can be usedin a more efficient way by providing at least a part of a distributedpeer-to-peer application to a (available) peer-to-peer processingapparatus by means of a peer-to-peer application of a peer-to-peernetwork. In other words, the distribution, implementation and operationof task(s) in form of distributed peer-to-peer application(s) in acommunication system can be managed and controlled without a centralinstance but by a peer-to-peer application of a peer-to-peer network.

Thereby, a peer-to-peer module assigned to the at least one processingapparatus may be capable of at least receiving a part of the distributedpeer-to-peer application from the peer-to-peer application andpeer-to-peer network, respectively. By the fact that instead of acentral server or a platform, a peer-to-peer network (also called aframework) undertakes the in particular tamper-proof controlling of theprovision and distribution of task(s) in the communication system, inparticular, the provision of one or more distributed peer-to-peerapplication(s), by means of a peer-to-peer application, high securitystandards are achieved in that all computers (peer nodes or simplynodes) in the peer-to-peer network, at least a part of the peercomputers (e.g. validation nodes) in the peer-to-peer network,monitor(s) at least the correct provision of said distributedpeer-to-peer application to the peer-to-peer processing apparatus bymeans of the peer-to-peer application. The peer-to-peer processingapparatus is able to process one or more of the provided distributedpeer-to-peer application(s) during two or more time slices.

Furthermore, the transaction costs can be significantly reduced. Nocentral, superior platform, server, cloud, etc. is required. Thecomplexity of managing and controlling a communication system can besignificantly reduced. User data and other confidential data can besecurely managed. Resources can be used in a more efficient way.

The peer-to-peer processing apparatus may be a computing device. Thepeer-to-peer processing apparatus may comprise at least one processormodule, such as at least one core processor. The peer-to-peer processingapparatus is, in particular, capable of processing at least two tasksduring a predefinable time unit. Preferably, the time unit is dividablein two or more time slices which can be successively (one after theother) processed by the at least one processor module.

The communication system may comprise at least one peer-to-peer moduleassigned to the peer-to-peer processing apparatus. Preferably, eachpeer-to-peer module is uniquely assigned to a respective peer-to-peerprocessing apparatus. For instance, each peer-to-peer processingapparatus can comprise a peer-to-peer module. Preferably, the peer-topeer module is integrated in the peer-to-peer processing apparatus.

It is also possible that a communication connection is provided betweenthe peer-to-peer processing apparatus and the peer-to-peer moduleassigned to said peer-to-peer processing apparatus. This means that thepeer-to-peer module can at least communicate and/or act on behalf of thepeer-to-peer processing apparatus. For example, the peer-to-peer modulecan be partly formed by a separate processing device, such as mobilecommunication device (e.g. mobile phone, mobile computer, etc.), or itcan run on a remote stationary processing device (e.g. in a datacenter). In case of a mobile communication device or a remote processingdevice the at least one peer-to-peer processing apparatus may have asecure communication channel to the processing device (or mobilecommunication device) of the data center and the processing deviceitself may have a connection to the peer-to-peer network. In anembodiment the remote processing device may be a gateway to thepeer-to-peer network. This means that the peer-to-peer processingapparatus can securely communicate via its peer-to-peer module and thegateway to the peer-to-peer network.

In comparison to a client server communication system in which a serverprovides a service and a client uses the service, these roles arecancelled in the present peer-to-peer network. Each participant (e.g.node) of the peer-to-peer network can use a service and the like andoffer such a service (such as the temporary processing of a task). Inparticular, a peer-to-peer network is self-determined and/orself-organized (without any higher-level units). In the present casepreferably each node and computer, respectively, of the peer-to-peernetwork comprises the (same) peer-to-peer application.

The peer-to-peer module is configured to communicate, e.g. send/receivemessages to/from the peer-to-peer application. The peer-to-peer modulemay be a peer and node, respectively, of the peer-to-peer network.

At least one task to be conducted/processed can be assigned to apeer-to-peer processing apparatus by providing at least a part of adistributed peer-to-peer application to the peer-to-peer processingapparatus such that the at least one processor module can process thepart of the distributed peer-to-peer application during at least one ofthe plurality of time slices. The distributed peer-to-peer application(also called decentral peer-to-peer application or “DAPP”) may be asoftware module comprising code processable by a processor module suchthat a specific task can be conducted. Examples of DAPPs may be

-   -   A DAPP configured for Calculating (e.g. CPU usage)    -   A DAPP using distributed sensors to create services like        brightness map    -   A DAPP using distributed actors (e.g. a DAPP of a first logistic        provider let open a post box for parcel next to a DAPP of a        further logistic provider).

By way of example, a distributed peer-to-peer application can be dividedinto two or more parts which can be provided to a respective number of(different) peer-to-peer processing apparatuses for processing. It maybe also possible that the (total) distributed peer-to-peer applicationis provided to a single peer-to-peer processing apparatus.

It is noted that one or more physical standard (wired and/or wireless)communication networks can be used for communication. It shall beunderstood that a peer-to-peer processing apparatus and its peer-to-peermodule, respectively, can be formed as a node of the peer-to-peernetwork, and thus, the peer-to-peer processing apparatus and itspeer-to-peer module, respectively, may be a part of the peer-to-peernetwork including at least a part of the peer-to-peer application.

According to a first embodiment of the communication system of thepresent invention, the peer-to-peer application may be configured togenerate at least one distributed application transaction agreement atleast about the provision of the part of the distributed peer-to-peerapplication to the peer-to-peer processing apparatus. The distributedapplication transaction agreement may be stored by the peer-to-peerapplication e.g. in the peer-to-peer application or a storagearrangement controlled by the peer-to-peer application. In particular,technical details about the provision of at least one part of the atleast one distributed peer-to-peer application can be stored in thepeer-to-peer application including e.g. implementation and/or operationdetails. The peer-to-peer application, such as a controlling means ofthe peer-to-peer application, may be configured to control the provision(e.g. transmission of data packets) of the at least one part of thedistributed peer-to-peer application to the at least one peer-to-peerprocessing apparatus in accordance with the stored technical details.Preferably, two or more entities (e.g. a request entity and at least onepeer-to-peer processing apparatus) can self-sufficiently initiate thegeneration of a distributed application transaction agreement by thepeer-to-peer application.

According to a preferred embodiment, the generated distributedapplication transaction agreement may comprise at least one of:

-   -   distributed application transaction criterion,    -   part of the distributed peer-to-peer application or identifier        of the part of the distributed peer-to-peer application,    -   identifier assigned to the at least one peer-to-peer processing        apparatus and/or peer-to-peer module assigned to the        peer-to-peer processing apparatus,    -   identifier assigned to a request entity and/or peer-to-peer        module assigned to the request entity    -   priority information assigned to the part of the distributed        peer-to-peer application    -   address data of a recipient of potential processing results of        the processing of the part of the distributed peer-to-peer        application    -   operation details of the part of the distributed peer-to-peer        application including at least one operation duration condition,        such as an operation start condition and/or operation end        condition.

The generated distributed application transaction agreement may compriseat least one part of the distributed peer-to-peer application to beprovided and/or an identifier of the at least one part of thedistributed peer-to-peer application to be provided. The (unique)identifier of the distributed peer-to-peer application can be used toaccess the at least one part of the distributed peer-to-peer applicationstored e.g. in a storage arrangement or the peer-to-peer application.E.g. the controlling means can access the storage arrangement controlledby the peer-to-peer application and can select the at least one part ofthe distributed peer-to-peer application to be provided based on theidentifier of the at least one part of the distributed peer-to-peerapplication.

Further security information, such as (encryption) keys needed to accessthe storage arrangement, can be stored in the distributed applicationtransaction agreement in order to increase the security.

In addition, identifiers of preferably all involved entities, such asthe at least one (first) peer-to-peer processing apparatus and/or the atleast one request entity can be stored. The respective identifier may bea unique (peer-to-peer) identifier assigned to the respective entity,such as the peer-to-peer processing apparatus and/or request entity,i.e. the entity which requests for the transfer of a task to one or morepeer-to-peer processing apparatus.

For instance, an identifier may be a serial number, a communicationsaddress, a unique code, signature, name or other identifier of anentity, user of the entity, or the like. By storing these details, thepeer-to-peer application can control the provision of a specified taskto one or more specific peer-to-peer processing apparatuses.

Alternatively or preferably additionally, at least one distributedapplication transaction criterion may be stored in the distributedapplication transaction agreement. The distributed applicationtransaction criterion may be a financial value to be transferred from anaccount of e.g. a request entity to an account of the provider of apeer-to-peer processing apparatus for providing processing power to therequest entity in order to conduct a specific task.

The distributed application transaction agreement may comprise furtherdetails, such as priority information assigned to the part of thedistributed peer-to-peer application, address data of a recipient ofpotential results of the processing of the part of the distributedpeer-to-peer application and/or operation details of the part of thedistributed peer-to-peer application including at least one operationduration condition, such as an operation start condition and operationend condition. For instance, a priority value can be defined as priorityinformation. The priority value can be used by the peer-to-peerprocessing apparatus to (dynamically) allocate the time length to thetime slice during which the distributed peer-to-peer application isprocessed. In particular, scheduling means of the peer-to-peerprocessing apparatus may be configured to allocate the time length ofthe two or more time slices to two or more tasks depending on thepriority information (value) associated with a task. A task having ahigher priority than another task may e.g. get a time slice with alonger time length than the other task (according to predefinedallocation rules).

Further, the processing of a task may result in a processing result(e.g. one or more (intermediate or end) result data set(s)). By storingaddress data of the intended recipient of the processing result (e.g.the request entity) the at least one processing result can be forwardedto the desired recipient preferably by means of the peer-to-peerapplication.

Furthermore, a task may only be temporarily allocated or transferred toa peer-to-peer processing apparatus. In such a case, operation durationcondition (s), such as an operation start condition (e.g. start time ofthe process or of the implementation process or other start conditions)and operation end condition (end time of the process or desiredde-installation time or other end condition) (e.g. after the generationof the desired processing result) can be defined. Such condition(s) mayinclude the implementation time and deletion time of the distributedpeer-to-peer application.

According to a further embodiment of the present invention, thepeer-to-peer application may comprise at least one controlling meansconfigured to control at least the implementation of the part of thedistributed peer-to-peer application on the peer-to-peer processingapparatus. The controlling means may be, in particular, configured tocontrol the implementation of the distributed peer-to-peer applicationin accordance with the generated distributed application transactionagreement. The controlling means may be also configured to controlfurther processes e.g. according to technical details stored in thedistributed application transaction agreement. For instance, theprovision (e.g. transmission) of the distributed application transactionagreement (e.g. the respective data packets), forwarding of processingresult(s), operation (duration) condition(s) and the like can becontrolled and conducted in accordance with the generated distributedapplication transaction agreement by the controlling means.

The controlling means may be preferably formed by a control smartcontract comprising computer code which can be capable of at leastcontrolling the provision of the at least one part of the distributedpeer-to-peer application. The controlling means can be executed by atleast a part of the nodes, preferably all nodes of the peer-to-peernetwork. Preferably, the controlling means can be comprised by adistributed application transaction agreement. In other words, thepeer-to-peer application can be configured to generate a distributedapplication transaction agreement including the generation of thecontrolling means.

Preferably, the controlling means may be configured to control theimplementation of the part of the distributed peer-to-peer applicationon the peer-to-peer processing apparatus by causing the transmission ofthe part of the distributed peer-to-peer application to the peer-to-peermodule assigned to the peer-to-peer processing apparatus. In otherwords, the roll-out of the distributed peer-to-peer application can becontrolled by the controlling means of the peer-to-peer application.

Transmission of the part of the distributed peer-to-peer applicationincludes, in particular, the transmission of one or more messagescomprising portions of the at least one part of the distributedpeer-to-peer application to the peer-to-peer processing apparatus and/orthe provision of the part of the distributed peer-to-peer application bythe peer-to-peer application such that the peer-to-peer processingapparatus can read out (e.g. download) the respective data by itspeer-to-peer module. For instance, based on an identifier and/or keytransmitted to the peer-to-peer module, the peer-to-peer module iscapable of accessing the correct data package in order to download thecorrect part of the distributed peer-to-peer application (in particular,in accordance with the stored distributed application transactionagreement).

Furthermore, according to a further embodiment of the presentapplication, the peer-to-peer processing apparatus may comprise garbagecollection means configured to remove the part of the distributedpeer-to-peer application. In particular, the garbage collection meanscan be controlled and/or monitored by the peer-to-peer application. Forinstance, based an end operation condition, the peer-to-peerapplication, e.g. the controlling means, can initiate the deletion ofthe previously provided part of the distributed peer-to-peerapplication, as defined in the generated distributed applicationtransaction agreement. The peer-to-peer application can monitor whetherthe part of the distributed peer-to-peer application is actually deletedby the garbage collection means. By way of example only, the computerlanguage GO can be used which provides (automatic) garbage collectionmeans.

In order to further improve the manipulation security, according to afurther embodiment of the communication system at least one of the firsttime slice and the further time slice may be formed as an encapsulatedtime slice. Encapsulated means that the part of the distributedpeer-to-peer application is stored and processed in a securedenvironment. Preferably, at least all time slices comprising distributedpeer-to-peer applications can be formed as encapsulated time slices. ADAPP which is running in the encapsulated environment (time slice)communicate via the operating system of the peer-to-peer processingapparatus to at least one interface (e.g. in rder to communicate withsensor(s), actor(s) and/or the peer-to-peer application). The interfacemay be formed by the peer-to-peer module. The operating system may beconfigured to allow the DAPP only to communicate during the time sliceand slot, respectively, in which the DAPP is active. Outside the timeslice assigned to the DAPP the Dapp cannot communicate because theoperating system may give the DAPP no computing power.

In addition, the peer-to-peer processing apparatus may comprise at leastone sensor and/or at least one actor. A sensor may be any measuring unitconfigured to measure one or more (physical) parameters. An actor may bea unit which can amend its state based on an input parameter, such as aninstruction. For instance, an actor can cause a mechanical movement. Thepart of the distributed peer-to-peer application (temporarily)implemented on the peer-to-peer processing apparatus may be configuredto operate at least one of the sensor and actor. For instance, duringthe first time slice allocated to a first distributed peer-to-peerapplication e.g. one or more actor(s) can be operated in accordance tothe first distributed peer-to-peer application and during a further timeslice allocated to a further distributed peer-to-peer application theone or more actor(s) can be operated in accordance with the furtherdistributed peer-to-peer application. In a similar way, at least onesensor can be operated. A peer-to-peer processing apparatus comprisingat least one sensor and/or actor can conduct two or more different tasksalmost in parallel.

The transfer of a task in form of at least a part of a distributedpeer-to-peer application can be initiated by a user e.g. using a requestentity. According to one embodiment, the communication system maycomprise at least one further peer-to-peer module assigned to at leastone request entity. The peer-to-peer module assigned to the requestentity may be configured to transmit a request message in order toinitiate the transfer of the part of the distributed peer-to-peerapplication to the peer-to-peer processing apparatus. Preferably, arequest message can be accepted by a peer-to-peer processing apparatusby means of an accepting message. In particular, after accepting arequest message by one or more peer-to-peer processing apparatus(es),the above described distributed application transaction agreement can begenerated and stored by the peer-to-peer application. Thereby, thegeneration of such an agreement can be initiated or caused by at leastone peer-to-peer module.

Furthermore, according to one embodiment, at least one of the first taskand the further task may be at least one of the group comprising:

-   -   at least a part of a further distributed peer-to-peer        application,    -   at least one peer-to-peer communication application, in        particular, configured to operate the peer-to-peer module, and    -   at least one system application.

As described above, during a first time slice at least a part of adistributed peer-to-peer application can be processed. During at leastone further time slice, at least a part of a further distributedpeer-to-peer application. There may be further time slice(s) reservedfor predefined tasks, such as one or more system tasks in form of one ormore system applications and/or one or more communication application(s)including at least one peer-to-peer communication application, inparticular, configured to operate the peer-to-peer module.

What is more, according to a preferred embodiment, the peer-to-peerapplication may comprise at least one registration means configured toreceive a registering message of a first peer-to-peer module assigned tothe (first) peer-to-peer processing apparatus and/or to receive aregistering message of a peer-to-peer module assigned to the requestentity. The registration means may be configured to register the (first)peer-to-peer processing apparatus by storing a unique (peer-to-peer)identifier of the (first) peer-to-peer processing apparatus and/or toregister the request entity by storing a unique (peer-to-peer)identifier of the request entity. For instance, in order to conducttasks in form of one or more distributed peer-to-peer application forother participants of the peer-to-peer network a peer-to-peer processingapparatus must be registered in the peer-to-peer application.

An entity, device, apparatus, unit or the like can be registered in thepeer-to-peer application as e.g. a so called smart asset. Eachregistered entity or apparatus can be stored with its unique(peer-to-peer) identifier e.g. in one or more identifier list(s) ofauthorized peer-to-peer processing apparatus and/or request entity. Inparticular, the respective signatures of the registered peer-to-peerprocessing apparatus and/or request entity can be stored in the list.Then, one or more validation node(s) can conduct a validation process bychecking the signature of a received message prior to processing themessage. Preferably, the signature of a received message can be comparedwith the stored signatures of authorized sender(s) (e.g. peer-to-peerprocessing apparatus(es) and/or request entity(ies)). In particular, aplurality of validation nodes can conduct said validation process. Onlyif all validation nodes of the peer-to-peer network come to a positiveresult, the message is further processed. The security can be furtherincreased.

According to an embodiment of the communication system according to thepresent invention, at least one peer-to-peer module may be configured tocause a registration of the entity and apparatus, respectively, (or thecorresponding peer-to-peer module) in the peer-to-peer application (ornetwork) by transmitting a registering message comprising at least anidentifier assigned to the entity (apparatus) and/or peer-to-peermodule. The identifier might be already a peer-to-peer identifier oranother identifier suitable to uniquely identify the entity. The (uniquepeer-to-peer) identifier may be a serial number or a smart asset hash ofe.g. the entity, the user's name of the entity, a communication addressof a peer-to-peer processing apparatus, a signature, etc. If e.g. theidentifier is not already a unique peer-to-peer identifier, e.g. if theidentifier is a name of a peer-to-peer processing apparatus, thepeer-to-peer application, in particular, the registration means, may beconfigured to generate a unique peer-to-peer identifier for therespective entity (according to preset rule(s)). In particular, theregistration means of the peer-to-peer application may register therespective entities by storing at least the peer-to-peer identifierand/or signature (the signature may be the identifier) in thepeer-to-peer application and/or a storage arrangement controlled by thepeer-to-peer application.

It shall be understood that an entity can be a user registered in thepeer-to-peer application. Each registered user can be stored with orlinked to its unique (peer-to-peer identifier) e.g. in one or moreidentifier list(s) of authorized entities. According to an embodiment ofthe communication system according to the present invention, a user mayauthenticate himself at one of the peer-to-peer processing apparatus ora user terminal of the user comprising a peer-to-peer module.

Prior to the registration of an peer-to-peer processing apparatus,request entity or the like, at least part of the nodes (peers) of thepeer-to-peer network may check whether the registering requirements(such as specific entity/apparatus specifications or valid signatures orcompliance requirements) predefined by the peer-to-peer network are metby the entity/device requesting registration. For instance, it may benecessary that a peer-to-peer processing apparatus meets predefinedtechnical specifications (e.g. a predefined minimum processing power,etc.). In order to perform the check, preferably, further data may beincluded in the registering message. In particular, the peers/nodes ofthe peer-to-peer network may provide registering rules or registeringrequirements which must be fulfilled by an entity, peer-to-peerprocessing apparatus or the like to be regarded as a trustful entity.Rules/requirements may be individually defined by the peers of apeer-to-peer network. E.g. it may be necessary that a new entity must berecommended by an entity which is already a participant of thepeer-to-peer network. In addition, it may be necessary that thisparticipant must have a reputation factor which increases a predefinedminimum reputation factor. A reputation factor may indicate whether apeer-to-peer processing apparatus is able to conduct transferred tasktrustfully and correctly.

As previously described, it may be possible that in return to thetakeover of the processing of a task in form of a distributedpeer-to-peer application through a peer-to-peer processing apparatus,the request entity has to fulfill at least one generated distributedapplication transaction criterion prior to the takeover of said task,during the processing of the task and/or after the (successful)processing of the task. For instance, one or more success conditions maybe stored in the distributed application transaction agreement.According to one embodiment, the peer-to-peer application may beconfigured to cause the conduction of a distributed applicationtransaction criterion transaction based on at least one distributedapplication transaction criterion of the stored distributed applicationtransaction agreement, preferably, stored in the peer-to-peerapplication. For instance, the distributed application transactioncriterion may be a financial value e.g. depending on the one or moresuccess conditions and/or the generated priority value. For instance,the higher the priority value the higher the financial value.

Financial values can be (instantaneously) exchanged with a transactionvia a cryptocurrency. In an alternative or additional embodimentmicropayment channels may be used for a (constant) payment stream thatcan be handled e.g. partly off-chain to reduce the amount of on-chaintransactions. In a further embodiment so called state channels or statenetworks (e.g. Raiden Network) may be used to exchange digital tokensoff-chain in a secure way. Opening and/or closing of state channels maybe registered on the peer-to-peer application. This means thatindividual transactions may not be stored on the peer-to-peerapplication in order to improve scalability and avoid movement trackingof pseudonyms on the peer-to-peer application. According to the presentinvention, a man-in-the-middle is not necessary. Fully automatedprocesses from authentication to charging and billing can be provided.

According to a further preferred embodiment, the at least onepeer-to-peer application can be a decentralized register or a shareddatabase configured to store data, e.g. distributed applicationtransaction agreement(s), identifier(s) (e.g. signatures), distributedpeer-to-peer application(s), sensor data set(s), result data set(s) ofconducted tasks, etc., with given certain proofs or signatures. Inaddition to e.g. identifiers, the decentral register can store computercode acting as e.g. controlling means for controlling the transfer of adistributed peer-to-peer application to one or more peer-to-peerprocessing apparatus(es). In particular, the code can be invoked by atransaction to the address of the code in so called ‘smart contracts’.This code can be processed on the node(s) of the decentral register.

In a further embodiment the computer codes of a device may includealgorithm(s) for de-central cognitive analytics or machine learning.Analytics and learning can be shared with other apparatuses and/oraggregated and further analyzed via the peer-to-peer applications.

A decentralized register can be readable at least by a part of theparticipants of the peer-to-peer network. In particular, every computernode, peer-to-peer processing apparatus and/or entity e.g. including atleast one respective peer-to-peer module can comprise the peer-to-peerapplication. The decentralized register, at least the public part (i.e.may be without private contracts) may be read at least by eachparticipant of the peer-to-peer network. In particular, all peer-to-peermodules and all other computers of the peer-to-peer network canpreferably read all information in the peer-to-peer application formedas a register. Preference is also that all peer-to-peer modules and allother computers of the peer-to-peer network can send messages to orwrite messages to the peer-to-peer application. A message or transactionsent to a smart contract (e.g. controlling means or registration means)may start the execution of a code of the smart contract while using datastored in the smart contract. For instance, sending a registeringmessage to a registration means may start the execution of the coderesulting in conducting the registration process, as describedhereinbefore. In a similar way, an implementation process can beinitiated and conducted by the controlling means formed by a smartcontract.

The peer-to-peer application can be built upon the following elements:peer-to-peer network comprising Consensus System/Protocol, DataStructure, Merkle Trees, Public Key Signatures, Byzantine FaultTolerance. It may replicate data based on a consensus principle. It maybe auditable and traceable.

In a simple way information can be made available to preferably allparticipants. This may allow to carry out a review of the informationstored in the decentral register or the code executed in the decentralregister. Particularly preferably, each computer in the peer-to-peernetwork can be configured to review new information, in particular,based on older information stored in the peer-to-peer application. Inaddition, the at least one controlling means may be monitored by atleast a part of the nodes of the peer-to-peer network, preferably by allnodes. A manipulation can thus be prevented, at least detected.

Moreover, preferably each computer (node) can in each case comprise thecomplete data content of the peer-to-peer application, but include atleast a portion of the data contents of the peer-to-peer application, inparticular, of the decentral register. For example, it may be providedthat after a positive verification/validation (as described above) ofwritten information (e.g. a message sent to the peer-to-peerapplication) in the peer-to-peer application this information is savedby all computers, at least by a part of the computers. For instance,after the generation of a distributed application transaction agreementand/or after a successful registration and/or a successful processing ofa task, the agreement and/or identifier and/or processing result can bestored at least by a part, preferably all nodes of the peer-to-peernetwork. In other words, the data is stored by a part, preferably allnodes of the peer-to-peer network. The tamper resistance of the datastored in the peer-to-peer application can thereby be further improved.The at least temporarily transfer of a task to a peer-to-peer processingapparatus, the communication between two or more peer-to-peer processingapparatus and/or the conduction of a distributed application transactioncriterion transaction can be securely controlled.

In order to store new information in a tamper-proof way, thepeer-to-peer application can comprise encryption means and/or signaturemeans and/or verification/validation means, wherein at least one of theencryption means and/or signature means and/or verification/validationmeans is configured to store data, such as a distributed applicationtransaction agreement (s), identifier(s), distributed peer-to-peerapplication(s), processing result(s), etc. In particular, it can beprovided that by the hash function a link is established with at leastone previously stored information in the decentral register. Furtherdata, such as request messages, registering messages, ordinary,contextual and/or transaction data of an entity can be stored.

The peer-to-peer application may be formed by a Directed Acyclic Graph(DAG). A directed acyclic graph, such as IOTA or Tangle, means thatblocks (or nodes of the graph) are coupled to each other via directededges. Thereby, direct means that the (all) edges have (always) a samedirection similar to time. In other words, it is not possible to stepback. Eventually, acyclic means that loops do not exist.

In a particularly preferred embodiment of the present system, thepeer-to-peer application can be a block chain or decentral ledgercomprising at least two blocks coupled to each other (e.g. EthereumBlock chain with Smart Contracts). The block chain technology or“decentral ledger technology” is already used in the payment by means ofa crypto currency, such as Bitcoin. It has been recognized that by aparticular configuration of a block chain, at least the transfer of atask in form of a distributed peer-to-peer application to anpeer-to-peer processing device can be checked without the need of acentral server or the like. E.g. a controlling means can be easilyimplemented as a smart contract in a block chain. A communication systemand the available processing resources in the communication system canbe managed in an easy manner.

In addition, the block chain can be used to generate predefinedaction(s) caused by at least one peer-to-peer module and/or acontrolling means in a tamper-proof manner. The block chain according tothe present embodiment is particularly a decentralized,peer-to-peer-based register in which all data related to at least oneaccess control process can be logged. A block chain is particularlysuitable as a technical means to replace a central entity/server in asimple and secure manner.

In further embodiments of the peer-to-peer application, the block chaincan be a permissionless or permissioned block chain. In a specific casethe block chain can be public, consortium or private block chain.

In a further embodiment, the peer-to-peer application can be formed bymultiple block chains which are connected via mechanisms such as sidechains or smart contracts. A peer-to-peer node can run one or moredifferent block chain client (s).

Data of the peer-to-peer application can be stored on the “decentralledger technology” and/or the decentral ledger steers (encrypted) datastorage accessible via the internet and preferably in de-central datastorage arrangement, object store and database, respectively, such asInterplanetary File System (IPFS) or storj or in a distributedBlockchain database (e.g. BigChainDB). Access to encrypted data to thirdparty entities is managed via the permission means formed as one or moresmart contract(s) on the block chain.

Furthermore, data, in particular, one or more parts of a distributedpeer-to-peer application can be stored on a first peer-to-peerprocessing apparatus wherein one or more part(s) of the distributedpeer-to-peer application can be transferred to one or more furtherpeer-to-peer processing apparatus(es) by means of the peer-to-peerapplication, preferably, under the control of the controlling means.

In addition, data feeds can be provided by the peer-to-peer application(so called “smart oracles”). Data feeds can provide further datarelating to a task and/or peer-to-peer processing apparatus from atleast one further source. For instance, further data needed to process atask can be provided by a data provider. Data can be captured fromtrusted sources off-chain and stored on the block chain or stored viathe block chain on a decentral data storage entity.

Furthermore, information among peer-nodes can be exchanged by apeer-to-peer messaging system. This means a peer node can send a messageto another peer node to submit an information or to trigger an action.Messages can be clear text, signed, hashed, time-stamped and/orencrypted. This means that not all data exchanged among peer nodes mustbe stored on the block chain.

In a further embodiment, the at least one peer-to-peer network can beformed by a plurality of computer nodes and e.g. a peer-to-peer module,such as the peer-to-peer module of a peer-to-peer processing apparatus,the peer-to-peer module of a request entity, etc.. In other words, thepeer-to-peer processing apparatus and/or the request entity may be anode of the peer-to-peer network. According to one embodiment of apeer-to-peer module said module may be only configured to communicatewith the plurality of computer nodes. In other words, the peer-to-peermodule is not a computer node of the peer-to-peer network but only aparticipant. Such a peer-to-peer module does not comprise thepeer-to-peer application but only provides an interface module, such asan application programming interface (API), and a decentral applicationfor communication with the computer nodes of the peer-to-peer network orthe peer-to-peer application, such as a block chain or a smart contracton the block chain. For instance, such a peer-to-peer module can eithersend clear text or encrypted information or generate a secure connection(e.g. tunnel) to a peer-to-peer gateway (or so called “remote node”) inorder to communicate with the peer-to-peer network. This allows reducingthe required processing power of the peer-to-peer module.

In one implementation of the peer-to-peer network, there can be only onevalidating peer or full node, e.g. only one node can be configured toperform a validation process, e.g. checking a received signature, andone or more observing (or monitoring) nodes. An observing node canvalidate transactions to establish a trust level but does not validateall transactions which is done by the validating peer.

In an alternative embodiment of a peer-to-peer module, the peer-to-peermodule (and the assigned entity or apparatus, respectively) is one ofthe computer nodes. In this case, the peer-to-peer module comprises atleast a part of the peer-to-peer application. In particular, thepeer-to-peer module can comprise preferably the total data content ofthe peer-to-peer application or can access the information stored inanother node. For instance, the peer-to-peer module might be a so called“light node” or a decentral application (DAPP) connected to a remotenode.

It is noted that in the present case, according to an embodiment, thepeer-to-peer module comprises at least an API configured to communicatewith the peer-to-peer application, such as the block chain. In additionto the API, the peer-to-peer module comprises a decentral application ofsoftware comprising local algorithms at least configured to create andtransmit data, such as instructions information, result data sets, tothe peer-to-peer application via the API. The decentral application socalled “DAPP” is at least configured to process and transmit said data.

Preferably, as described hereinbefore, data and messages can be signedor encrypted or can be transmitted via a cryptographically securedtunnel or a secured internet connection to a peer-to-peer node runningthe peer-to-peer application, such as the block chain. In anotherparticular embodiment, also the peer-to-peer application itself isimplemented in the peer-to-peer module, i.e. the peer-to-peer module isa node of the peer-to-peer network comprising the decentral application,the API and the peer-to-peer application, such as the block chain ordecentral ledger.

Data and transactions stored on the block chain do not provide“transactional privacy”. Transactions between pseudonyms may be (often)stored in clear text on the block chain. In some cases data stored onthe block chain are encrypted and the keys may be handled via the blockchain. Transactions between pseudonyms are stored in clear text on theblock chain. Privacy preserving, secure transactions or execution ofcomputer code can be achieved with cryptographic tools such as zeroknowledge (zk) proofs or zk Succinct Non-interactive Arguments(zk-SNARK). Transactions or algorithms are separated into two parts: asmart contract on the block chain and a private contract. A privacypreserving protocol ensures the privacy of data and the correctness ofcode execution (SNARK verification is done via the smart contract onchain). The private contract computation can be done by at least onepeer-to-peer processing apparatus and/or a set of nodes, off-chaincomputers and/or done in measured launch environment or a securehardware enclave for attestation and sealing that cannot be manipulatedby other software code running on the devices. In an alternativeembodiment secure Multi-Party-Computing (sMPC) systems can be used fortransactional privacy. Examples for privacy preserving protocols andcomputation are HAWK and MIT Enigma.

With zero knowledge proof (zk Proofs) the parties can see that thealgorithm is executed correctly in a private contract, but the inputdata are not disclosed to the party. In addition selective privacy canbe achieved by sharing keys to decrypt transactions for reporting andauditing purposes.

To securely deploy code and or data into a device a trusted executionenvironment such as Intel SGX or TPM or Direct Anonymous Attestationmodule can be integrated with a peer-to-peer module.

Similarly, in an alternative (not shown) embodiment a particularly largepeer-to-peer network may be divided in two or more (physical or logicalor dynamically virtual) clusters. In a corresponding peer-to-peernetwork, for example, a validation (of a subset of transactions) mayonly be carried out by the members of one cluster (a subset of nodes;e.g. sharding of a block chain to improve the scalability). In a furtherembodiment the peer-to-peer application can be formed using multipleblock chains. These block chains are connected via frameworks such assidechains or smart contracts.

A further aspect of the invention is a method for operating acommunication system, in particular, a previously describedcommunication system. The method comprises:

-   -   providing at least a part of at least one distributed        peer-to-peer application to at least one peer-to-peer processing        apparatus by means of a peer-to-peer application of at least one        peer-to-peer network,    -   processing the provided part of the distributed peer-to-peer        application by at least one processor module during at least one        of a first time slice and at least one further time slice.

It is noted that the provision of at least a part of the distributedpeer-to-peer application may include the distribution of the (total)distributed peer-to-peer application. The method can be used to at leasttemporarily transfer one or more tasks to one or more peer-to-peerprocessing apparatus(es).

A further aspect of the invention is a peer-to-peer processingapparatus, in particular, for a previously described communicationsystem. The peer-to-peer processing apparatus comprises at least oneprocessor module configured to process at least a part of a first taskduring a first time slice and at least a part of at least one furthertask during at least one further time slice. The peer-to-peer processingapparatus comprises at least one peer-to-peer module. At least one ofthe first task and the further task is a distributed peer-to-peerapplication provided to the peer-to-peer module by means of at least onepeer-to-peer application of at least one peer-to-peer network.

A still further aspect of the invention is a peer-to-peer application ofa peer-to-peer network. The peer-to-peer application comprises at leastone controlling means configured to control the provision of at least apart of at least one distributed peer-to-peer application to at leastone peer-to-peer processing apparatus such that the provided part of thedistributed peer-to-peer application is processable by at least oneprocessor module of the peer-to-peer processing apparatus during atleast one of a first time slice and at least one further time slice.

The controlling means may be in particular formed as a smart contract ofthe peer-to-peer application, such as a block chain. For instance, thecontrolling means can form or be a distributed application transactionagreement.

The features of the methods, systems, modules, peer-to-peerapplications, peer-to-peer processing apparatuses and computer programscan be freely combined with one another. In particular, features of thedescription and/or the dependent claims, even when the features of thedependent claims are completely or partially avoided, may beindependently inventive in isolation or freely combinable with oneanother.

These and other aspects of the present patent application becomeapparent from and will be elucidated with reference to the followingfigures. The features of the present application and of its exemplaryembodiments as presented above are understood to be disclosed also inall possible combinations with each other.

BRIEF DESCRIPTION OF THE DRAWINGS

The figures show:

FIG. 1 shows a schematic view of a first embodiment of a communicationsystem according to the present invention,

FIG. 2 shows a schematic view of an embodiment of a peer-to-peerprocessing apparatus according to the present invention,

FIG. 3 shows a schematic view of a further embodiment of a communicationsystem according to the present invention,

FIG. 4 shows a schematic view of an embodiment of a peer-to-peerapplication according to the present invention,

FIG. 5 shows a schematic view of a further embodiment of ancommunication system according to the present invention, and

FIG. 6 shows a diagram of an embodiment of a method according to thepresent invention.

DETAILED DESCRIPTION

Like reference numerals in different figures indicate like elements.

FIG. 1 shows a first embodiment of a communication system 100, inparticular, a peer-to-peer communication system 100, according to thepresent invention. The depicted peer-to-peer communication system 100comprises a peer-to-peer network 102, a storage arrangement 114, apeer-to-peer processing apparatus 108 and a request entity 118 in formof a computing device 118.

In contrast to prior art systems, according to the present invention, apeer-to-peer network 102 is provided. In other words, a substantialdifference compared with prior art systems is that no central instance(e.g. a backend or home controller or the like) and/or third partyorganization is provided. Instead of a central instance, thepeer-to-peer network 102 comprises a plurality of nodes 106.1, 106.2,106.3 and computers 106.1, 106.2, 106.3, respectively. Preferably, eachof the nodes 106.1, 106.2, 106.3 comprises the (same) peer-to-peerapplication 104. In particular, the peer-to-peer application 104 and itscontent is preferably the same on each node 106.1, 106.2, 106.3resulting in that a manipulation of one or more peer-to-peerapplication(s) of respective nodes can be detected due to the differencebetween the non-manipulated nodes.

A peer-to-peer network 102 is characterized in the present case in thateach node 106.1, 106.2, 106.3 and/or participant 120, 130 is preferablyconnectable at least to every other node 106.1, 106.2, 106.3 and/orparticipant 120, 130. For instance, at least one physical standardnetwork (wired and/or wireless) can be used for connection. Forcommunicating via the at least one physical standard network suitabletransceiver modules may be arranged in the respective entities/devices.

In addition, the computers 106.1, 106.2, 106.3 have equal rights,something which distinguishes them from a server-client structure ofprior art systems.

The peer-to-peer application 104 may preferably be a public register 104that can, in particular, be inspected by all participants 106.1, 106.2,106.3, 120, 130 (not only the nodes 106.1, 106.2, 106.3) of thepeer-to-peer network 102. As described above, each node 106.1, 106.2,106.3 preferably has the (entire) public register 104. It may also beenvisaged that only part of the register can be provided on a node(light node).

In a particularly preferred embodiment, the peer-to-peer application 104may be a block chain 104 which will be explained in more detailshereinafter. It shall be understood that the peer-to-peer network maycomprise further nodes.

The peer-to-peer application 104 may be configured to manage and controlthe provision of distributed peer-to-peer applications (DAPPs) to one ormore peer-to-peer processing apparatuses 108. The peer-to-peerapplication 104 may comprise a controlling means 124. In particular, theprovision and implementation of a DAPP onto one or more peer-to-peerprocessing apparatus(es) 108 and e.g. the deletion of the DAPP from oneor more peer-to-peer processing apparatus(es) 108 can be controlled bythe controlling means 124 of the peer-to-peer application 104. Thecontrolling means 124 may be formed as a smart contract 124. As can beseen, the controlling means 124 may be executed preferably on all nodes106.1, 106.2, 106.3 of the peer-to-peer network 102 resulting in a highsecurity.

The peer-to-peer processing apparatus 108 may be a computer 108 e.g.controlled by the peer-to-peer application 104 or a node of thepeer-to-peer network. The peer-to-peer processing apparatus 108 maycomprise a peer-to-peer module 130 configured to communicate with thepeer-to-peer network 102 and peer-to-peer application 104, respectively.For instance, a DAPP to be transferred and, in particular, to beinstalled onto the peer-to-peer processing apparatus 108 may be receivedvia the peer-to-peer module 130 from the peer-to-peer application 104.In addition, any processing results may be forwarded to the peer-to-peerapplication (and/or a further entity) by means of the peer-to-peermodule 130.

Further, the peer-to-peer processing apparatus 108 comprises a processormodule 110 configured to process a first task, such as a first DAPP112.1, and a further task, such as a further DAPP 112.2. A more detailedexplanation of the peer-to-peer processing apparatus 108 will follow(e.g. in connection with FIG. 2).

Optionally, the peer-to-peer system 100 may comprise at least onestorage arrangement 114. For instance, a plurality of (different) DAPPsmay be stored in a storage arrangement 114 controlled by thepeer-to-peer application 104. As described above, data can be stored inthe peer-to-peer application 104 and/or in a storage arrangement 114and/or another entity (e.g. a peer-to-peer processing apparatus)controlled by the peer-to-peer application 104. Preferably, the storagearrangement 114 comprising a plurality of decentral storage units 116may be formed as a decentral file system (such as IPFS) or a decentralobject store (such as storj) or a decentral distributed database (suchas BigchainDB) controlled by the peer-to-peer application 104. By way ofexample, the controlling means 124 can access the storage arrangement114 to provide one or more specific DAPPs to one or more peer-to-peerprocessing apparatus(es) 108. For accessing the correct DAPP, each DAPPcan be provided with a unique identifier. Further security means, suchas encryption key(s) can be additionally used.

Further optionally, the peer-to-peer system 100 may comprise one or more(separate) request entity(ies) 118. A request entity 118 may comprise apeer-to-peer module 120 configured to communicate with the peer-to-peernetwork 102. For instance, the request entity 118 may send a requestmessage to the peer-to-peer network 102 and peer-to-peer application104, respectively, by means of the peer-to-peer module 120 in orderrequest for the transfer of a (processing) task (e.g. in form of a DAPP)to one or more peer-to-peer processing apparatus(es) 108. It shall beunderstood that the request entity may be also a peer-to-peer processingapparatus (e.g. which is currently overloaded) and/or a node of thepeer-to-peer network.

FIG. 2 shows a schematic view of an embodiment of a peer-to-peerprocessing apparatus 208 according to the present invention. The to-peerprocessing apparatus 208 comprises at least one processor module 210,e.g. one or more core processors. The processor module 210 is configuredto process two or more tasks during a (pre-)defined time unit. Inparticular, the defined time unit can be divided into two or more timeslices 222.1, 222.2, 222.3, 222.4. After processing the task comprisedby the last time slice 222.4 the task allocated to the first time slice222.1 is processed again. It shall be understood that the allocation oftask can be dynamically adapted e.g. based on current work load, changedpriority values, etc.

For instance, during the first time slice 222.1 the processor module 210may be configured to process a first distributed peer-to-peerapplication 212.1. During a second time slice 222.2 the processor module210 may be configured to process a first distributed peer-to-peerapplication 212.2. Further, an internal (operational) system task 213can be conducted during the third time slice 222.3 (e.g. schedulingmeans can adapt the allocation of tasks to the two or more time slices).Eventually, during a fourth time slice 222.4 a communication task 215for communicating with the peer-to-peer application can be processed.

Preferably, the different tasks 212.1 and 212.2 can have differentpriorities resulting in different time slice length. For instance, ascheduling means can be provided. The scheduling means may be configuredto allocate available time slices and/or time length(s) to individualtime slice(s) according to predefinable rules (e.g. during the thirdtime slice 212.3). For instance, each task may be provided with apriority value. If the first task 212.1 has a higher priority than thefurther task 212.2, the first time slice 222.1 can have a longer timeperiod than the further time slice 222.2. Further, a time length of atime slices may be only configurable between a minimum time length and amaximum time length. In addition, some time slices may be fixedlyreserved for mandatory tasks, such as system and/or communication tasks.

It shall be understood that there may be more or less time slices pertime unit and more or less tasks, respectively.

FIG. 3 shows a further embodiment of a communication system 300according to the present invention. The depicted communication system300 comprises a peer-to-peer network 301 with a plurality of nodes 306(for the sake of clarity merely one node 306 is depicted), twopeer-to-peer processing apparatuses 308.1, 308.2 and a request entity318.

The request entity 318 may comprise a peer-to-peer module 320. By meansof the peer-to-peer module 320 the requests entity 318 may send arequest message for the transfer of a task to one or more peer-to-peerprocessing apparatuses 308.1, 308.2 to the peer-to-peer application.

Furthermore, a first peer-to-peer processing apparatus 308.1 maycomprise at least one processor module 310.1 and at least one sensor326. The further peer-to-peer processing apparatus 308.2 may comprise atleast one processor module 310.3 and at least one actor 328. Aspreviously described, during a defined time unit (e.g. the time unit maypreferable be between a few millisecond up to some seconds (may depende.g. on switching time of actors and/or sensors)) two or more tasks canbe conducted during two or more respective time slices 322.1 to 322.4.

For instance, based on a request (and on a subsequent generateddistributed application transaction agreement) of the request entity, afirst task in form of a first distributed peer-to-peer application canbe implemented on the first peer-to-peer processing apparatus 308.1 ande.g. processed during a first time slice 322.1. For instance, the sensor326 can be operated during the first time slice 322.1 in accordance withthe distributed peer-to-peer application. During a further time slice(e.g. 322.4) a communication task can be processed by transmittingsensor data set(s) to the peer-to-peer application, wherein the sensordata set(s) comprise one or more sensor value(s) measured during thefirst time slice 322.1. In particular, the sensor data set(s) can beforwarded to the peer-to-peer application 324 by means of thepeer-to-peer module 330. Preferably, the peer-to-peer module 330 canprovide the at least one sensor data set (and the message, respectively)with a unique signature. The peer-to-peer application may be configuredto conduct a validation process by checking the signature of a receivedmessage prior to processing the message. In particular, all nodes (atleast a part of the nodes, i.e. the validation nodes) may conduct thisprocess e.g. by comparing the signature of the received sensor data set(or any other message) with stored valid signatures. Only if a match isfound by at least all validation nodes the validation result is positiveand the sensor data set (or any other message) may be further processed,e.g. forwarded to a request entity or another peer-to-peer processingapparatus.

During a second time slice 322.2 the sensor 326 can be operated inaccordance with a further distributed peer-to-peer application. In asimilar way, the further peer-to-peer processing apparatus 308.2 and itsactor can be operated.

FIG. 4 shows an embodiment of a peer-to-peer application 404 accordingto the present invention.

The depicted peer-to-peer application 404 is a register readable, inparticular, by the participants of the peer-to-peer network. Thereby,data set(s) or information e.g. in form of messages can be writtenand/or read into/from the register 404 by a peer-to-peer module of anpeer-to-peer processing apparatus, a request entity and/or any otherparticipants in the peer-to-peer network. In a preferred embodiment, thepeer-to-peer application 404 may be a block chain 404.

Hereinafter, it is assumed in the following description of the presentembodiment that the at least one peer-to-peer application 404 is a blockchain 404. However, the following remarks can be easily transferred toother peer-to-peer applications, such as a Directed Acyclic Graph (DAG).A directed acyclic graph, such as IOTA or Tangle, means that blocks (ornodes of the graph) are coupled to each other via directed edges.Thereby, direct means that the (all) edges have (always) a samedirection similar to time. In other words, it is not possible to stepback. Eventually, acyclic means that loops do not exist.

In further embodiments of the peer-to-peer application the block chaincan be a permissionless or permissioned block chain. In a specific casethe block chain can be public, consortium or private block chain.

In a further embodiment, the peer-to-peer application can be formed withmultiple block chains which are connected via mechanisms such as sidechains or smart contracts. Interoperability among block chains can beestablished.

The block chain 404 is formed by at least one block 451, 453, 455,preferably by a plurality of interconnected blocks 451, 453, 455. Thefirst block 451 may also be called genesis block 451. As can be seen, ablock 453, 455 (except for the first block 451) refers to each previousblock 451, 453. A new block can be created by a computationallyintensive process (for example, so called “mining” or through anotherappropriate process, such as voting) and will be particularly providedto all participants of the peer-to-peer network.

The present block chain 404 is particularly adapted to receive messages,such as messages comprising sensor data set(s), request data, resultdata set(s), distributed peer-to-peer application(s), registering data,etc., e.g. from a peer-to-peer module of a previously describedpeer-to-peer processing apparatus, request entity, off-chain computingentity or from another peer-to-peer device/unit of another participantof the peer-to-peer network. Further, the block chain 404 isparticularly adapted to save these messages in the block chain 404.Furthermore, the block chain 404 is configured to generate messages e.g.based on a request message, instruction message, event, validationprocess, a processing result and/or caused by a peer-to-peer moduleand/or the execution of code of e.g. a controlling means 424. Inparticular, the block chain 404 is at least configured to control andmanage a communication system, such as shown in FIG. 1 and/or 3.

In particular, a (newly) received message can be saved and published inthe current block 455 of the block chain 404. Due to the configurationof a block chain 404 as a public register 404, said data message of e.g.a peer-to-peer module can be read by preferably all participants of thepeer-to-peer network. Alternatively or additionally, data of a messagemay be stored on a decentral file service or distributed block chaindatabase controlled by the block chain 404.

As already described, in the present block chain 404 different types ofmessages and data sets, respectively, for example, within a smartcontract (algorithm and/or storage at the block chain 404) can beprocessed and/or stored. In the present example, the block chain 404comprises a controlling means 424 in form of a smart contract 424. Aspreviously described the controlling means 424 may be at leastconfigured to control the provision of a distributed peer-to-peerapplication to a peer-to-peer processing apparatus.

Furthermore, in the block chain 404 one or more distributed applicationtransaction agreement(s) 436 may be stored. A distributed applicationtransaction agreement 436 may be generated on an initiation of at leastone entity, such as a user and/or peer-to-peer processing apparatusand/or request entity which desires the transfer of at least one task toat least peer-to-peer processing apparatus in order cause the processingof the task by the peer-to-peer processing apparatus. An example of ageneration of such a distributed application transaction agreement 436will be described in the following:

A distributed application transaction agreement 436 may comprise atleast one of the following data:

-   Identifier(s): One or more identifier(s) of the involved entities,    such as an identifier of the request entity, and one or more    identifier(s) of the one or more peer-to-peer processing    apparatus(es) to which a one or more tasks should be provided,    identifier of the provider entity of the one or more peer-to-peer    processing apparatus(es), etc.-   Distributed Application Transaction Criterion: Criterion that must    be fulfilled by e.g. a request entity for the provision,    implementation and/or operation of a task in form of a distributed    peer-to-peer application to/by the at least one peer-to-peer    processing apparatus-   Task: At least a part of the distributed peer-to-peer application to    be provided (e.g. an identifier and/or storage address of the part    of the distributed peer-to-peer application)-   Priority Information E.g. a priority value indicating the urgency of    the conduction of a task-   Further Operation Details E.g. details about the desired processing    results and the transmission of the results to the request entity    (or another entity), start condition (e.g. start time) and/or end    condition (e.g. end time), success condition(s) of a tasks, etc.

The distributed application transaction criterion may be e.g. an amountof cryptocurrency e.g. per time unit (e.g. per h) which has to betransferred prior to, during and/or after the provision and/orconduction of the task to and/or through at least one peer-to-peerprocessing apparatus. Preferably, at least a part of the agreed amountof cryptocurrency can be locked by the peer-to-peer application 404prior to the provision action. In an embodiment the distributedapplication transaction criterion may be a payment channel for streamingsmall amounts of crypto tokens per each time unit. It shall beunderstood that other transaction criteria and further information canbe included in a distributed application transaction agreement 436. Moreinformation/criteria can be, for example, a time stamp, an ID of thetransaction agreement and the like. In addition, the

In order to generate a distributed application transaction agreement436, a peer-to-peer module of a request entity (e.g. a peer-to-peerprocessing apparatus or other computing device) and the peer-to-peerapplication or a further peer-to-peer module of a provider entity (e.g.a peer-to-peer processing apparatus or other computing device of e.g.the provider/user of a peer-to-peer processing apparatus) can exchangerequest and response (acceptance) messages via the peer-to-peerapplication 404. A request message 438 may comprise indications aboutthe above data (e.g. identifiers, transaction criteria, desired task(s),desired time frame).

For instance, a request entity may send a request for a transfer of atask in form of a distributed peer-to-peer application to thepeer-to-peer application in order to detect one or more peer-to-peerprocessing apparatus(es) capable of performing the task as desired (e.g.within desired processing time period (e.g. desired start and end time),desired priority, desired distributed application transaction criterion,etc.). In response to such a request message a peer-to-peer module of apeer-to-peer processing apparatus(es) may transmit an acceptance message440 to the peer-to-peer module of the request entity. As a result adistributed application transaction agreement can be generated. Forinstance, the acceptance message 440 may comprise identical or at leastsimilar data details as compared with a request message 438.Additionally, the acceptance message 440 can comprise a referenceindication to a previous message, such as the ID of the request message438.

If, for example, the acceptance message 440 comprises a higher or othertransaction criterion and/or another desired processing time period, theacceptance message 440 can be called a counter-offer message. This canbe accepted by the peer-to-peer module of the request entity through afurther acceptance message. Based on this a peer-to-peer module of arequest entity and/or provider entity and/or peer-to-peer processingapparatus may cause the generation of a distributed applicationtransaction agreement 436 about the transfer of at least one task to theat least one peer-to-peer processing apparatus and the subsequentprocessing of the task by the peer-to-peer processing apparatus.

In particular, there can be multiple offer messages and/orrequest/accepting messages and/or messages comprising a requestedpeer-to-peer processing apparatus/distributed peer-to-peer applicationfor different transaction criterions. Each entity can give guidelines,according to which at least one distributed application transactionagreement 436 or other agreements can be generated. In a preferablyautomated, such as iterative process, each request/offer message can beassociated to an optimally corresponding acceptance message. The blockchain 404 may be configured to generate, based on the messages of apeer-to-peer module, a distributed application transaction agreement436.

In addition, each peer-to-peer processing apparatus can transmit offermessages to the peer-to-peer application comprising information aboutthe capabilities of a peer-to-peer processing apparatus, such asprocessing power, available processing time for a future time period,available sensor(s) and/or actor(s), reputation factor, distributedtransaction criterion and the like. Based on the current status, eachpeer-to-peer processing apparatus can send updated offer messages e.g.regularly, at predefined time points and/or depending on detected statuschanges.

Further, the controlling means 424 may be configured to control theprovision of the at least one part of a distributed peer-to-peerapplication to be processed by a processor module of a peer-to-peerprocessing apparatus during a time slice of a plurality of time slices,in particular, based on the one or more distributed applicationtransaction agreement(s) 436. The controlling means 424 may be executedby at least part of the nodes of the peer-to-peer network for conductingthe provision of said part of a distributed peer-to-peer application.Thereby, the controlling means 424 can be a part of the distributedapplication transaction agreement(s) 436. For instance, based on astored part of a distributed peer-to-peer application or storedidentifier of a stored part of a distributed peer-to-peer application,the peer-to-peer application 404, in particular, the controlling means424 may provide the part of a distributed peer-to-peer application tothe at least one peer-to-peer processing apparatus (defined in thedistributed application transaction agreement(s) 436).

Also an update transaction agreement can be generated and stored in thepeer-to-peer application comprising information about the conduction ofupdate process(es) of at least one peer-to-peer processing apparatus.

Moreover, a block chain 404 may comprise a registration means 442configured to register a (new) peer-to-peer processing apparatus and/orrequest entity in the block chain 404 as a smart asset. Also a newevaluating means and/or storage arrangement or the like can beregistered.

After a positive registration process, the respective entity can beregistered within the block chain 404 e.g. by storing its uniqueidentifier in an identifier list 444. Further details can be stored inthe list, such as signatures, technical specifications of the entity,permissions, etc.

The list comprising e.g. signatures of authorized participants of thepeer-to-peer network (and of the communication system) can be used for apreviously described validation process.

FIG. 5 shows a schematic view of another embodiment of a communicationsystem 500 of the invention. In the present embodiment only nodes andparticipants 506.1, 506.2, 508.1, 508.2, 518.2 of the peer-to-peernetwork 502 are shown. In the present example, it is assumed that allnodes 506.1, 506.2, 508.1, 508.2, 518.2 comprise the peer-to-peerapplication (not shown).

The nodes 508.1, 508.2 may correspond to peer-to-peer processingapparatuses and e.g. be formed by the respective peer-to-peer modules ofthe peer-to-peer processing apparatuses. The node 518.2 may be a requestentity realized by a peer-to-peer module of the request entity. Nodes506.1 and 506.2 may be other nodes which are not a peer-to-peerprocessing apparatus and/or request entity. It shall be understood thatnodes can be full, remote or light nodes.

As can be seen, two different types of peers or node computers 506.1,508.1, and 506.2, 508.2. 518.2 are presently illustrated. All peers506.1, 506.2, 508.1, 508.2, 518.2 are comprised by the peer-to-peernetwork 502. In the present embodiment, however, only a part of thepeers 506.1, 506.2, 508.1, 508.2, 518.2 in the present case, the peers(nodes) 506.1, 508.1, check the validity (e.g. conduct a validationprocess) of e.g. a signature of a received message, a provision process(e.g. comprising the controlling means and execute the controlling meansin accordance with a generated agreement) of a task in form of adistributed peer-to-peer application and/or further data stored in thepeer-to-peer application, such as agreements, sensor data set messages,processing result messages, and the like.

Furthermore, only a part of the entire peers can be configured to storethe peer-to-peer application and/or only a part of the peers can beconfigured to execute the algorithms of a smart / private contract (e.g.only peers 506.1, 508.1, as previously described). Since thevalidation/verification of e.g. identification data requires aconsiderable computational effort, it may be advantageous for reasons ofefficiency, if only a part of the peers 506.1, 508.1, especiallyparticularly powerful 506.1, 508.1 perform the validation and/orcontrolling algorithms.

Validation, analytics and optimization can be done on-chain oroff-chain, as described hereinbefore. Off-chain validation and/oroptimization can be managed by the peer-to-peer application, like thecode on the block chain. Powerful means in particular a high computingpower. In other words, in the present case a valid entry in thepeer-to-peer application, such as a block chain, is assumed if (only) apart of the peers 506.1, 508.1 comes to a positive result. It shall beunderstood that only a single, especially particularly powerful peer canperform the validation, analytics and/or optimization process.

Similarly, in an alternative (not shown) embodiment, a particularlylarge peer-to-peer network may be divided in two or more clusters. In acorresponding peer-to-peer network, for example, a validation will onlybe carried out by the members of one cluster (e.g. sharding of a blockchain to improve the scalability). In a further embodiment thepeer-to-peer application can be formed using multiple block chains.These block chains are connected via frameworks such as sidechains orsmart contracts or interlegder.

FIG. 6 shows an embodiment of a method according to the presentinvention. The method is, in particular, configured to operate acommunication system, such as the communication system according to FIG.1 and/or 3.

In a first step 601, a request entity may send a request message to thepeer-to-peer application. For instance, a first peer-to-peer processingapparatus may form the request entity. For example, the firstpeer-to-peer processing apparatus is currently overloaded, and thus,desires to transfer a task (or part of a task) to a further peer-to-peerprocessing apparatus currently having free resources. Beforetransmitting a request message to the peer-to-peer application, thefirst peer-to-peer processing apparatus may read out current offermessage(s) of one or more further peer-to-peer processing apparatus(es)stored in the peer-to-peer application.

For instance, one or more further peer-to-peer processing apparatus(es)can transmit (e.g. by its peer-to-peer module) an offer messagecomprising one or more of the following information:

-   -   Processing power    -   Available sensor(s)    -   Available actor(s)    -   Geographic location (e.g. GPS coordinates)    -   Availability (e.g. future time period) of processing power,        sensor, actor, etc.    -   Distributed application transaction criterion,    -   Pot. agreement term (e.g. start and/or end condition (e.g.        time))    -   Necessary entitlement(s)    -   Identifier of the peer-to-peer processing apparatus    -   Reputation factor

The request message of the first peer-to-peer processing apparatus canrefer to a specific offer message (e.g. using an identifier of the offermessage and/or identifier of the peer-to-peer processing apparatus). Therequest message can comprise similar information as the offer message.Further information may be information about the desired task to betransferred and/or priority information.

The peer-to-peer application and/or a further peer-to-peer processingapparatus may respond to a request message by transmitting an acceptancemessage to the first peer-to-peer processing apparatus. If there aredeviations between the content of the request message and the content ofthe acceptance message, the acceptance message can be called acounter-offer message. It may be possible that a plurality of messagesbetween two or more entities are exchanged e.g. in an automatic anditerative process (indicated by the dotted arrow).

Further, it is noted that each message can be provided with a signatureof the sender. Validation nodes may conduct a validation process bychecking the signature of a received message, as previously described.The present method may only be prosecuted if (all) validation nodes cometo a positive result. Otherwise the method may be interrupted and/orstopped.

After a request message is accepted, in step 603, the peer-to-peerapplication can generate a distributed application transactionagreement. In said agreement technical and further details about the atleast temporarily transfer of a task from e.g. the first peer-to-peerprocessing apparatus to the further peer-to-peer processing apparatuscan be stored, as described above.

In step 604, the controlling means may control the provision (e.g.transmission) and e.g. implementation of a part of a distributedpeer-to-peer application in accordance with the generated distributedapplication transaction agreement. For instance, based on a startcondition and an identifier of the desired distributed peer-to-peerapplication, the controlling means may initiate the transmission andimplementation of the distributed peer-to-peer application to/on thefurther peer-to-peer processing apparatus.

Then, in step 605, the at least one processor module of the furtherpeer-to-peer processing apparatus processes the provided and implementeddistributed peer-to-peer application during at least one time slice of aplurality of time slices. The processing may be controlled and/ormonitored by the peer-to-peer application and e.g. by validation node(s)of the peer-to-peer network. E.g. a sensor and/or actor may be operatedand/or processing result(s) may be transmitted to e.g. the firstpeer-to-peer processing apparatus, in particular, in accordance with thegenerated distributed application agreement.

After a successful processing of said distributed peer-to-peerapplication by the at least one processor module of the furtherpeer-to-peer processing apparatus, e.g. by detection of the fulfillmentof an end condition and/or success condition stored in the distributedtransaction agreement, the distributed peer-to-peer application may beirretrievably deleted by e.g. a garbage collection means (step 606).Also this process step can be conducted under the control of thepeer-to-peer application and the validation nodes, respectively.

In the present case, in step 607 a distributed application transactioncriterion transaction can be conducted. For instance, a stored financialvalue can be (instantaneously) exchanged with a transaction via acryptocurrency from an account assigned to the request entity to anaccount assigned to the further peer-to-peer processing apparatus. Asdescribed above, step 607 can alternatively or additionally be performedprior to transferring the task and/or during the conduction of the task.

There may be further optional steps. For instance, the request entitycan (automatically) assess the performance of the further peer-to-peerprocessing apparatus. Based on the assessment, a reputation factor canbe adapted.

All references, including publications, patent applications, and patentscited herein are hereby incorporated by reference to the same extent asif each reference were individually and specifically indicated to beincorporated by reference and were set forth in its entirety herein.

The use of the terms “a” and “an” and “the” and similar referents in thecontext of describing the invention (especially in the context of thefollowing claims) is to be construed to cover both the singular and theplural, unless otherwise indicated herein or clearly contradicted bycontext. The terms “comprising,” “having,” “including,” and “containing”are to be construed as open-ended terms (i.e., meaning “including, butnot limited to,”) unless otherwise noted. Recitation of ranges of valuesherein are merely intended to serve as a shorthand method of referringindividually to each separate value falling within the range, unlessotherwise indicated herein, and each separate value is incorporated intothe specification as if it were individually recited herein. All methodsdescribed herein can be performed in any suitable order unless otherwiseindicated herein or otherwise clearly contradicted by context. The useof any and all examples, or exemplary language (e.g., “such as”)provided herein, is intended merely to better illuminate the inventionand does not pose a limitation on the scope of the invention unlessotherwise claimed. No language in the specification should be construedas indicating any non-claimed element as essential to the practice ofthe invention.

Preferred embodiments of this invention are described herein, includingthe best mode known to the inventors for carrying out the invention.Variations of those preferred embodiments may become apparent to thoseof ordinary skill in the art upon reading the foregoing description. Theinventors expect skilled artisans to employ such variations asappropriate, and the inventors intend for the invention to be practicedotherwise than as specifically described herein. Accordingly, thisinvention includes all modifications and equivalents of the subjectmatter recited in the claims appended hereto as permitted by applicablelaw. Moreover, any combination of the above-described elements in allpossible variations thereof is encompassed by the invention unlessotherwise indicated herein or otherwise clearly contradicted by context.

1. A communication system, in particular, peer-to-peer communicationsystem, comprising: at least one peer-to-peer network with a pluralityof nodes comprising at least one peer-to-peer application, at least onepeer-to-peer processing apparatus connectable to the nodes andcomprising at least one processor module configured to process at leasta part of a first task during a first time slice and at least a part ofat least one further task during at least one further time slice, atleast one peer-to-peer module assigned to the peer-to-peer processingapparatus and configured to communicate with the peer-to-peerapplication, wherein at least one of the first task and the further taskis a distributed peer-to-peer application provided to the peer-to-peerprocessing apparatus by means of the peer-to-peer application, whereinthe peer-to-peer application comprises at least one controlling meansconfigured to control the implementation of a part of the distributedpeer-to-peer application on the peer-to-peer processing apparatus bycausing the transmission of the part of the distributed peer-to-peerapplication to the peer-to-peer module assigned to the peer-to-peerprocessing apparatus, and wherein the transmission of the part of thedistributed peer-to-peer application includes the transmission of one ormore messages comprising at least portions of the part of thedistributed peer-to-peer application to the peer-to-peer processingapparatus and/or the provision of the part of the distributedpeer-to-peer application by the peer-to-peer application such that thepeer-to-peer processing apparatus can download the respective data byits peer-to-peer module.
 2. The communication system according to claim1, wherein the distributed peer-to-peer application is divided into twoor more parts, wherein the parts are transmitted to a respective numberof different peer-to-peer processing apparatuses.
 3. The communicationsystem according to claim 1, wherein the communication system comprisesat least one storage arrangement controlled by the peer-to-peerapplication and configured to store a plurality of distributedpeer-to-peer applications, wherein the controlling means is configuredto access the storage arrangement to provide one or more specificpeer-to-peer applications to one or more peer-to-peer processingapparatuses.
 4. The communication system according to claim 1, whereinthe peer-to-peer application is configured to generate a distributedapplication transaction agreement about the provision of the part of thedistributed peer-to-peer application to the peer-to-peer processingapparatus wherein the distributed application transaction agreementcomprises at least one of: distributed application transactioncriterion, part of the distributed peer-to-peer application oridentifier of the part of the distributed peer-to-peer application,identifier assigned to the at least one peer-to-peer processingapparatus and/or peer-to-peer module assigned to the peer-to-peerprocessing apparatus, identifier assigned to a request entity and/orpeer-to-peer module assigned to the request entity, priority informationassigned to the part of the distributed peer-to-peer application,address data of a recipient of potential processing results of theprocessing of the part of the distributed peer-to-peer application,operation details of the part of the distributed peer-to-peerapplication including at least one operation duration condition, such asan operation start condition and/or operation end condition.
 5. Thecommunication system according to claim 1, wherein at least onescheduling means is provided, wherein the scheduling means is configuredto allocate available time slices and/or time length(s) to individualtime slice(s) according to predefinable rules, wherein the schedulingmeans is, in particular, configured to allocate the time length of theat least two time slices, to two or more tasks depending on the priorityinformation associated with a task.
 6. The communication systemaccording to claim 1, wherein the peer-to-peer processing apparatuscomprises at least one garbage collection means configured to remove thepart of the distributed peer-to-peer application.
 7. The communicationsystem according to claim 1, wherein at least one of the first timeslice and the further time slice is formed as an encapsulated timeslice, and wherein a distributed peer-to-peer application which isrunning in the encapsulated time slice communicate via the operatingsystem of the peer-to-peer processing apparatus to at least oneinterface, wherein the operating system is configured to allow thedistributed peer-to-peer application only to communicate during the timeslice, in which the distributed peer-to-peer application is active. 8.The communication system according to claim 1, wherein the peer-to-peerprocessing apparatus comprises at least one sensor and/or at least oneactor, wherein the part of the distributed peer-to-peer application isconfigured to operate at least one of the sensor and actor.
 9. Thecommunication system according to claim 1, wherein the communicationsystem comprises at least one further peer-to-peer module assigned to atleast one request entity, wherein peer-to-peer module assigned to therequest entity is configured to transmit a request message in order toinitiate the transfer of the part of the distributed peer-to-peerapplication to the peer-to-peer processing apparatus.
 10. Thecommunication system according to claim 1, wherein at least one of thefirst task and the further task is at least one of the group comprising:at least a part of a further distributed peer-to-peer application, atleast one peer-to-peer communication application, in particular,configured to operate the peer-to-peer module assigned to thepeer-to-peer processing apparatus, at least one system application. 11.The communication system according to claim 1, wherein the peer-to-peerapplication comprises at least one registration means configured toreceive a registering message of a peer-to-peer module assigned to thepeer-to-peer processing apparatus and/or to receive a registeringmessage of a peer-to-peer module assigned to a request entity, whereinthe registration means is configured to register the peer-to-peerprocessing apparatus by storing a unique identifier of the peer-to-peerprocessing apparatus and/or to register the request entity by storing aunique identifier of the request entity.
 12. The communication systemaccording to claim 4, wherein the peer-to-peer application is configuredto cause the generation of a distributed application criteriontransaction based on at least one distributed application criterion ofthe stored distributed application transaction agreement.
 13. Thecommunication system according to claim 1, wherein the at least onepeer-to-peer application is a decentralized register or a shareddatabase, wherein the peer-to-peer application is configured to storedata with given certain signatures.
 14. The communication systemaccording to claim 1, wherein the at least one peer-to-peer applicationis a block chain or decentral ledger comprising at least two blockscoupled to each other.
 15. A method for operating a communicationsystem, in particular, a communication system according to claim 1, themethod comprising: providing at least a part of at least one distributedpeer-to-peer application to at least one peer-to-peer processingapparatus by means of at least one peer-to-peer application of at leastone peer-to-peer network, wherein the peer-to-peer network comprises aplurality of nodes connectable to the peer-to-peer processing apparatus,controlling, by a controlling means, the implementation of a part of thedistributed peer-to-peer application on the peer-to-peer processingapparatus by causing the transmission of the part of the distributedpeer-to-peer application to the peer-to-peer module assigned to thepeer-to-peer processing apparatus, wherein the transmission of the partof the distributed peer-to-peer application includes the transmission ofone or more messages comprising at least portions of the part of thedistributed peer-to-peer application to the peer-to-peer processingapparatus and/or the provision of the part of the distributedpeer-to-peer application by the peer-to-peer application such that thepeer-to-peer processing apparatus can download the respective data byits peer-to-peer module, and processing the provided part of thedistributed peer-to-peer application by at least one processor module ofthe peer-to-peer processing apparatus during at least one of a firsttime slice and at least one further time slice.
 16. A peer-to-peerprocessing apparatus connectable to a plurality of nodes of at least onepeer-to-peer network, comprising: at least one processor moduleconfigured to process at least a part of a first task during a firsttime slice and at least a part of at least one further task during atleast one further time slice, at least one peer-to-peer module, andwherein at least one of the first task and the further task is adistributed peer-to-peer application transmitted to the peer-to-peermodule by means of at least one peer-to-peer application of thepeer-to-peer network.
 17. A peer-to-peer application of a peer-to-peernetwork with a plurality of nodes connectable to a peer-to-peerprocessing apparatus, comprising: at least one controlling meansconfigured to control the provision of at least a part of at least onedistributed peer-to-peer application to at least one peer-to-peerprocessing apparatus such that the provided part of the distributedpeer-to-peer application is processable by at least one processor moduleof the peer-to-peer processing apparatus during at least one of a firsttime slice and at least one further time slice, wherein the peer-to-peerapplication comprises at least one controlling means configured tocontrol the implementation of a part of the distributed peer-to-peerapplication on the peer-to-peer processing apparatus by causing thetransmission of the part of the distributed peer-to-peer application tothe peer-to-peer module assigned to the peer-to-peer processingapparatus, and wherein the transmission of the part of the distributedpeer-to-peer application includes the transmission of one or moremessages comprising at least portions of the part of the distributedpeer-to-peer application to the peer-to-peer processing apparatus and/orthe provision of the part of the distributed peer-to-peer application bythe peer-to-peer application such that the peer-to-peer processingapparatus can download the respective data by its peer-to-peer module.